Problem of time - PDFSEARCH.IO - Document Search Engine

Problem of time
Results: 679

#	Item
31	A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:23 Graph theory Mathematics Network theory Edsger W. Dijkstra Shortest path problem Graph Planar separator theorem Graph coloring
32	WCET State Authorization Network Statement of Work & Call for Participation – Year 6 July 1, 2016 – June 30, 2017 The Problem As of the Fall Term 2014, one in seven of all higher education students in the U.S. were t Add to Reading List Source URL: wcet.wiche.edu Language: English - Date: 2016-05-31 16:52:02 Technology Real-time computing Worst-case execution time Western Interstate Commission for Higher Education WCET International Traffic in Arms Regulations Television in the United States
33	Communication Networks of Visible Light Emitting Diodes with Intra-Frame Bidirectional Transmission Qing Wang Domenico Giustiniano Add to Reading List Source URL: conferences2.sigcomm.org Language: English - Date: 2014-12-01 16:56:48 Computing Media access control Network architecture Carrier sense multiple access with collision avoidance IEEE 802.11 Carrier sense multiple access with collision detection Data Throughput Physical layer Transmission time Carrier sense multiple access Hidden node problem
34	Woodpecker Little Library Of Earth Medicine The has very on-site how going information business maintenance. These history became back total to make this problem to a time that it was scheduled sales of conflicts in time Add to Reading List Source URL: sledgehockey.co.uk Language: English - Date: 2016-08-22 13:03:34 Woodpeckers Campephilus Haste to the Wedding Cinema of the United States Ivory-billed woodpecker
35	Routing Hazardous Materials on Time-Dependent Networks using Conditional Value-at-Risk Iakovos Toumazisa , Changhyun Kwona,1 a Department of Industrial and Systems Engineering Add to Reading List Source URL: toumiak.com Language: English - Date: 2014-05-21 14:13:54 Financial risk Actuarial science Economy Mathematical finance Applied mathematics Finance Value at risk Shortest path problem Risk Expected shortfall Coherent risk measure
36	Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:12 Computational complexity theory Analysis of algorithms Theory of computation Mathematics Edsger W. Dijkstra Algorithm Mathematical logic Theoretical computer science Time complexity Shortest path problem Asymptotically optimal algorithm Randomized algorithm
37	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:36 Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form
38	A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Complexity classes Theory of computation Polynomial-time approximation scheme APX Strong NP-completeness NP
39	System Time Distribution of Dynamic Traveling Repairman Problem under the PART-n-TSP Policy Jiangchuan Huang and Raja Sengupta Abstract— We propose the PART-n-TSP policy for the Dynamic Traveling Repairman Problem [1]. Add to Reading List Source URL: cpcc.berkeley.edu Language: English - Date: 2016-06-12 17:08:37 Mathematics Discrete mathematics Combinatorics Operations research Travelling salesman problem TSP Partition Polling system
40	Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem

UPDATE